Proposal and Evaluation of "Selfish-Gene with Limited Allowance" Type GA for Solving Constraint TSP
نویسندگان
چکیده
For realizing large-scale distribution network simulation applicable to supply-chain management, it is required to solve hundreds of time constraint large-scale (100 cities) Traveling Salesman Problem (TSP) within interactive response time, with practicable optimality. Thus, a "selfish-gene with limited allowance" type GA is proposed. Here, each gene of an individual satisfies only its constraints selfishly, disregarding the constraints of other genes in the same individual. Further, to some extent, even individuals that violate constraints can survive over generations and are given the chance of improvement. Our experiment proves that this method gives expert-level solutions for time constraint large-scale TSPs within several seconds.
منابع مشابه
A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملA CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملOptimal Allocation of Distributed Generation in Microgrid by Considering Load Modeling
Recent increment in carbon emission due to the dependency on fossil fuels in power generation sector is a critical issue in the last decade. The motivation to Distributed Generation (DG) in order to catch low carbon networks is rising. This research seeks to experience DG existence in local energy servicing in microgrid structure. Optimal sizing and placement of DG units is followed by this pap...
متن کامل